Measurability of unions of certain dense sets
نویسندگان
چکیده
منابع مشابه
Some Remarks on the Measurability of Certain Sets
The present note contains some elementary remarks on sets defined by simple geometric properties. Our main tool will be the Lebesgue density theorem. First we introduce a few notations : d(a, b) denotes the distance from a to b and Six, r) the open sphere of center x and radius r. A point x of a set A is said to be of metric density 1 if to every e there exists a ô such that AC\S{x, r) , r < 5,...
متن کاملMeasurability Properties of Sets of Vitali's Type
Assume a group G acts on a set. Given a subgroup H of G , by an //-selector we mean a selector of the set of all orbits of H . We investigate measurability properties of //-selectors with respect to G-invariant measures. Let us fix a set A and a group G acting on it. By p we denote a G-invariant countably additive measure on A . The most common example of such a situation is an invariant measur...
متن کاملextensions, minimality and idempotents of certain semigroup compactifications
در فصل اول مقدمات و پیش نیازهای لازم برای فصل های بعدی فراهم گردیده است . در فصل دوم مساله توسیع مورد توجه قرار گرفته و ابتدا شرایطی که تحت آن از یک فشرده سازی نیم گروهی خاص یک زیرگروه نرمال بسته یک گروه به یک فشرده سازی متناظر با فشرده سازی اولیه برای گروه رسید مورد بررسی قرار گرفته و سپس ارتیاط بین ساختارهای مختلف روی این دو فشرده سازی از جمله ایده آل های مینیمال چپ و راست و... مورد بررسی قرا...
15 صفحه اولFinite Sets as Complements of Finite Unions of Convex Sets
Suppose S ⊆ R is a set of (finite) cardinality n whose complement can be written as the union of k convex sets. It is perhaps intuitively appealing that when n is large k must also be large. This is true, as is shown here. First the case in which the convex sets must also be open is considered, and in this case a family of examples yields an upper bound, while a simple application of a theorem ...
متن کاملThe Complexity of Unions of Disjoint Sets
This paper is motivated by the open question whether the union of two disjoint NPcomplete sets always is NP-complete. We discover that such unions retain much of the complexity of their single components. More precisely, they are complete with respect to more general reducibilities. Moreover, we approach the main question in a more general way: We analyze the scope of the complexity of unions o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1995
ISSN: 0002-9939
DOI: 10.1090/s0002-9939-1995-1242071-7